IDEA as a Benchmark for Recon gurable Computing
نویسنده
چکیده
There is an increasing interest in using reconngurable hardware for performing computational tasks. Yet despite this interest, there are no suitable metrics for comparing the performance of reconngurable systems. We propose that the core encryption of the International Data Encryption Algorithm (IDEA), a popular 128-bit block cipher, be used for this purpose. We implemented the IDEA algorithm on two classes of reconngurable devices, the Xilinx 4000 series of eld programmable gate arrays and the proposed Garp (Gate Array Risc Processor, part of the UC Berkeley BRASS project) reconngurable array. The performance on these two devices was characterized and compared with other implementations.
منابع مشابه
Recon gurable Computing: Architectures, Models and Algorithms
The performance requirements of applications have continuously superseded the computing power of architecture platforms. Increasingly larger number of transistors available on a chip have resulted in complex architectures and integration of various architecture components on the chip. But, the incremental performance gains obtained are lower as the complexity and the integration increase. Recon...
متن کاملA Novel Dynamic Task Scheduling Algorithm for Grid Networks with Recon gurable Processors
The incorporation of recon gurable processors in computational grids promises to provide increased performance without compromising exibility. Consequently, grid networks (such as TeraGrid) are utilizing recon gurable computing resources next to general-purpose processors (GPPs) in their computing nodes. The near-optimal utilization of resources in a grid network considerably depends on the app...
متن کاملObject oriented development method for recon®gurable embedded systems
The authors present a novel method for developing recon®gurable systems targeted at embedded system applications. The paper shows how an existing object oriented design method (MOOSE) has been adapted to include recon®gurable hardware (FPGAs). Previous research on recon®gurable computing has concentrated on the ef®cient mapping of algorithms to FPGAs. It must be realised that recon®gurable hard...
متن کاملReconngurable Computing: Architectures, Models and Algorithms Current Science: Special Section on Computational Science
ion Mapping Parameters Scheduling Figure 2: Traditional Design Synthesis Approach and the Model-based Approach One major problem in using FPGAs to speed-up a computation is the design process. The \standard CAD approach" used for digital design is typically employed (see Figure 2). The required functionality is speci ed at a high level of abstraction via an HDL or a schematic. FPGA libraries sp...
متن کاملModule Allocation for Dynamically Reconfigurable Systems
The synthesis of dynamically recon gurable systems poses some new challenges for high-level synthesis tools. In this paper, we deal with the task of module allocation as this step has a direct in uence on the performance of the dynamically recon gurable design. We propose a con guration bundling driven module allocation technique that can be used for component clustering. The basic idea is to g...
متن کامل